A Revisit to Ordered Statistics Decoding: Distance Distribution and Decoding Rules

نویسندگان

چکیده

This paper revisits the ordered statistics decoding (OSD). It provides a comprehensive analysis of OSD algorithm by characterizing statistical properties, evolution and distribution Hamming distance weighted from codeword estimates to received sequence in reprocessing stages algorithm. We prove that distributions can be characterized as mixture models capturing error probability code weight enumerator. Simulation numerical results show our proposed approaches accurately describe distributions. Based on these with aim reduce complexity, several techniques, including stopping rules discarding rules, are proposed, their performance complexity accordingly analyzed. for various eBCH codes demonstrate techniques significantly negligible loss performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comdined Turbo Block Decoding and Equalisation

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...

متن کامل

Decoding randomly ordered DNA arrays.

We have developed a simple and efficient algorithm to identify each member of a large collection of DNA-linked objects through the use of hybridization, and have applied it to the manufacture of randomly assembled arrays of beads in wells. Once the algorithm has been used to determine the identity of each bead, the microarray can be used in a wide variety of applications, including single nucle...

متن کامل

Minimum Distance Decoding

Suppose we have a concatenated code where the outer code is an [N,K,D]Q code, and the inner code is an [n, k, d]q code, with Q = q. In section 4 we will see that the concatenated code is actually an [Nn,Kk, Dd]q code, but for now we will show the weaker property that it is an [Nn,Kk, Dd/2]q. Consider the näıve decoding procedure which uses the inner decoding scheme on each received symbol, then...

متن کامل

Comdined Turbo Block Decoding and Equalisation

In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...

متن کامل

Compressing and Decoding Term Statistics Time Series

There is growing recognition that temporality plays an important role in information retrieval, particularly for timestamped document collections such as tweets. This paper examines the problem of compressing and decoding term statistics time series, or counts of terms within a particular time window across a large document collection. Such data are large—essentially the cross product of the vo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2021

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2021.3078575